untimed systems
نویسندگان
چکیده
A comprehensive presentation of simulation techniques is given in terms of a simple (un-timed) automaton model. In particular, we discuss (1) reenements, (2) forward and backward simulations, (3) forward-backward and backward-forward simulations, and (4) history and prophecy relations. History and prophecy relations are new and are abstractions of the history and prophecy variables of Abadi and Lamport, as well as the auxiliary variables of Owicki and Gries. We give elegant and short proofs of soundness and completeness results for complicated simulations in terms of soundness and (partial) completeness results for simple simulations. In Part II of this paper, it is shown how most of the results for untimed automata can be carried over smoothly to the setting of timed automata.
منابع مشابه
Concurrency theory - calculi and automata for modelling untimed and timed concurrent systems
CONCURRENCY THEORY CALCULI AN AUTOMATA FOR MODELLING UNTIMED AND TIMED CONCURRENT SYSTEMS Are you looking for ebook concurrency theory calculi an automata for modelling untimed and timed concurrent systems PDF? You will be glad to know that right now concurrency theory calculi an automata for modelling untimed and timed concurrent systems PDF is available on our online library. With our online ...
متن کاملThe Influence of Durational Actions on Time Equivalences
The hierarchy of untimed equivalences is well understood for action-based systems. This is not the case for timed systems, where it is, for example, possible to detect concurrency by single timed action execution. To clarify the connection between equivalences in timed systems, a timed version of configuration structures is introduced together with timed equivalence notions adapted from untimed...
متن کاملVerifying Clocked Transition Systems
This paper presents a new computational model for real-time systems, called the clocked transition system (cts) model. The cts model is a development of our previous timed transition model, where some of the changes are inspired by the model of timed automata. The new model leads to a simpler style of temporal speciication and veriication, requiring no extension of the temporal language. We pre...
متن کاملVerifying Embedded C Software with Timing Constraints using an Untimed Model Checker
Embedded systems are everywhere, from home appliances to critical systems such as medical devices. They usually have associated timing constraints that need to be verified for the implementation. Here, we use an untimed bounded model checker to verify timing properties of embedded C programs. We propose an approach to specify discrete time timing constraints using code annotations. The annotate...
متن کاملTimeout Order Abstraction for Time-Parametric Verification of Loosely Synchronized Real-Time Distributed Systems
We present timeout order abstraction (TO-abstraction), a technique to systematically abstract a given loosely synchronized real-time distributed system (LSRTDS) into an untimed model. We define the subclass of LSRTDS’s that we can apply TO-abstraction using a syntax template that represents a restriction to Tempo, the primary modeling language of TIOA [7]. The untimed model obtained from the ab...
متن کاملForward and Backward Simulations, II: Timing-Based Systems
A general automaton model for timing-based systems is presented and is used as the context for developing a variety of simulation proof techniques for such systems. These techniques include (1) refinements, (2) forward and backward simulations, (3) hybrid forward backward and backward forward simulations, and (4) history and prophecy relations. Relationships between the different types of simul...
متن کامل